Shortest path tree

Results: 178



#Item
51Network theory / Routing algorithms / Planar separator theorem / Shortest path problem / Distance / Induced path / Tree / NP-complete problems / Path decomposition / Graph theory / Mathematics / Theoretical computer science

CCCG 2011, Toronto ON, August 10–12, 2011 Memory-Constrained Algorithms for Shortest Path Problems Tetsuo Asano∗ Abstract

Add to Reading List

Source URL: www.cccg.ca

Language: English - Date: 2011-08-06 04:11:13
52Graph / Tree / Shortest path problem / Degree / Planar separator theorem / Chordal graph / Graph theory / Mathematics / Theoretical computer science

An effective 3-in-1 keyword search method over heterogeneous data sources

Add to Reading List

Source URL: dbgroup.cs.tsinghua.edu.cn

Language: English - Date: 2012-09-26 08:02:06
53Spanning tree / Network theory / Shortest path problem / Minimum spanning tree / Theoretical computer science / Graph theory / Mathematics

CCCG 2006, Kingston, Ontario, August 14–16, 2006 Spanning trees across axis-parallel segments Michael Hoffmann∗ Abstract. Given a set P of points and a set S of pairwise disjoint axis-parallel line segments in the

Add to Reading List

Source URL: cccg.ca

Language: English - Date: 2008-10-27 22:58:24
54Network theory / Routing algorithms / Planar separator theorem / Shortest path problem / Distance / Induced path / Tree / NP-complete problems / Path decomposition / Graph theory / Mathematics / Theoretical computer science

CCCG 2011, Toronto ON, August 10–12, 2011 Memory-Constrained Algorithms for Shortest Path Problems Tetsuo Asano∗ Abstract

Add to Reading List

Source URL: 2011.cccg.ca

Language: English - Date: 2011-08-06 04:11:13
55Spanning tree / NP-complete problems / Network theory / Steiner tree problem / Minimum spanning tree / Connectivity / Tree / Graph / Shortest path problem / Graph theory / Theoretical computer science / Mathematics

IEEE International Conference on Data Engineering Progressive Keyword Search in Relational Databases Guoliang Li† †

Add to Reading List

Source URL: dbgroup.cs.tsinghua.edu.cn

Language: English - Date: 2012-01-09 09:42:51
56Operations research / Linear programming relaxation / Dynamic programming / Shortest path problem / Linear programming / Dantzig–Wolfe decomposition / Algorithm / Minimum spanning tree / Delayed column-generation / Mathematics / Mathematical optimization / Applied mathematics

A Branch-and-Price Algorithm for Combined Location and Routing Problems Under Capacity Restrictions Z. Akca ∗ R.T. Berger †

Add to Reading List

Source URL: coral.ie.lehigh.edu

Language: English - Date: 2010-06-19 14:25:53
57Tree decomposition / Graph / Dynamic programming / Tree / Shortest path problem / Path decomposition / Planar separator theorem / Graph theory / Mathematics / Theoretical computer science

CCCG 2008, Montr´eal, Qu´ebec, August 13–15, 2008 Application of computational geometry to network p-center location problems Binay Bhattacharya

Add to Reading List

Source URL: cccg.ca

Language: English - Date: 2008-10-29 00:10:51
58Network theory / NP-complete problems / Shortest path problem / Steiner tree problem / Routing algorithms / Graph theory / Theoretical computer science / Mathematics

Approximate Shortest Descent Path on a Terrain Sasanka Roy∗, Sachin Lodha†, Sandip Das‡ and Anil Maheshwari§ Abstract A path from a point s to a point t on the surface of a polyhedral terrain is said to be descent

Add to Reading List

Source URL: cccg.ca

Language: English - Date: 2008-10-28 21:25:54
59Network theory / Shortest path problem / Binary tree / Tree / Steiner tree problem / Connectivity / Minimum spanning tree / Quasi-bipartite graph / Graph theory / Theoretical computer science / Mathematics

CCCG 2014, Halifax, Nova Scotia, August 11–13, 2014 A Note on Online Steiner Tree Problems Gokarna Sharma∗ Abstract

Add to Reading List

Source URL: www.cccg.ca

Language: English - Date: 2014-06-20 14:13:50
60Connectivity / SPQR tree / Apex graph / Shortest path problem / Breadth-first search / Crossing number / Graph theory / Mathematics / Planar graphs

A Tighter Insertion-based Approximation of the Crossing Number Markus Chimani⋆1 and Petr Hlinˇen´ y⋆⋆ 2 1

Add to Reading List

Source URL: www.fi.muni.cz

Language: English - Date: 2011-05-24 08:45:38
UPDATE